Using subspace algorithm cointegration analysis for structural estimation
نویسنده
چکیده
Structural vector autoregression (SVAR) is often used as empirical instrument in order to examine business cycle fluctuations. Its popularity caused a comprehensive controversy in the literature. In this paper, we want to contribute to this discussion and introduce an alternative structural estimation method. Since we focus on the context of cointegration, our approach should be viewed as alternative to standard methods in this area, e.g. structural vector error correction models (SVECMs). We pursue the subspace cointegration analysis by Bauer and Wagner (2002, 2003, 2009) in using their subspace algorithm for structural estimation. Thereby, we follow a recent study by Kascha and Mertens (2009) in comparing our structural estimation approach to its standard counterpart in a Monte Carlo simulation. We analyze the estimated impulse responses and structural shocks and relate them to their true complements in terms of correlation and mean squared error. The results illustrate that our procedure is a serious option to structural estimation. However, our findings depend on the underlying model parametrization but stress the fact that it can dramatically outperform SVECM because of better small sample properties. (JEL E32, C15, C52)
منابع مشابه
The Performance of Subspace Algorithm Cointegration Analysis: A Simulation Study
This paper presents a simulation study that assesses the finite sample performance of the subspace algorithm cointegration analysis developed in Bauer and Wagner (2002b). The method is formulated in the state space framework, which is equivalent to the VARMA framework, in a sense made precise in the paper. This implies applicability to VARMA processes. The paper proposes and compares six differ...
متن کاملSemi-Blind Channel Estimation based on subspace modeling for Multi-user Massive MIMO system
Channel estimation is an essential task to fully exploit the advantages of the massive MIMO systems. In this paper, we propose a semi-blind downlink channel estimation method for massive MIMO system. We suggest a new modeling for the channel matrix subspace. Based on the low-rankness property, we have prposed an algorithm to estimate the channel matrix subspace. In the next step, using o...
متن کاملتخمین جهت منابع با استفاده از زیرفضای کرونکر
This paper proceeds directions of arrival (DOA) estimation by a linear array. These years, some algorithms, e.g. Khatri-Rao approach, Nested array, Dynamic array have been proposed for estimating more DOAs than sensors. These algorithms can merely estimate uncorrelated sources. For Khatri-Rao approach, this is due to the fact that Khatri-Rao product discard the non-diagonal entries of the corre...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملA low-complexity adaptive blind subspace channel estimation algorithm
A low-complexity adaptive blind subspace channel estimation algorithm is proposed for direct sequence spread spectrum CDMA systems. Compared with so-called hybrid adaptive channel estimation algorithms, where only the subspace estimation is carried out adaptively, the proposed algorithm is fully adaptive in that both subspace and channel estimates are updated recursively. The new algorithm is d...
متن کامل